A set partitioning heuristic for the generalized assignment problem
نویسندگان
چکیده
منابع مشابه
A Linear Relaxation Heuristic for the Generalized Assignment Problem
We examine the basis structure of the linear relaxation of the generalized assignment problem. The basis gives a surprising amount of information. This leads to a very simple heuristic that uses only generalized network optimization codes. Lower bounds can be generated by cut generation, where the violated inequalities are found directly from the relaxation basis. An improvement heuristic with ...
متن کاملHeuristic Algorithms for Solving the Set-partitioning Problem
A delivery problem which reduces to the NP-complete set-partitioning problem is investigated. The 3-opt, simulated annealing, tabu search and ant algorithms to solve the delivery problem are discussed.
متن کاملColumn Generation Based Heuristic for the Generalized Assignment Problem
This paper proposes a column generation based heuristic suitable for large and hard instances of the generalized assignment problem. First, just to be able to obtain the convergence of the column generation is reasonable times, it uses a sophisticated “triple” dual stabilization, combining piecewise linear penalty functions, Wentges’ dual smoothing and sub-gradient directional smoothing. In ord...
متن کاملHeuristic Algorithms for the Generalized Routing and Wavelength Assignment Problem
In this paper a generalized (static) routing and wavelength assignment problem is formulated, where the objective is to establish a given set of connections into the network while minimizing the number of wavelength channels at the same time. Connections can be normal lightpaths as well as anycast or multicast connections. Furthermore, each request can be for either a bidirectional or a unidire...
متن کاملHybrid Meta-heuristic Algorithm for Task Assignment Problem
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 1994
ISSN: 0377-2217
DOI: 10.1016/0377-2217(94)90338-7